COMMENT ⊗   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	ideas[f81,jmc]		random ideas
C00005 ENDMK
C⊗;
ideas[f81,jmc]		random ideas

1. The magic xerox drum remembers some of what it has copied.  When
it returns to the factory for recoating, it is debriefed.

2. Israel-France-Iraq

3. Dynamic compression member (name courtesy Robert Forward) has other
applications than the tower.
  It might be worthwhile to ask Rod for
and Lowell to consider briefly a hexagon at a few hundred mile altitude.
The hexagon might be simpler than the tower.
a. It might dangle a cable.
b. (Perhaps better).  A station so supported could be supplied by low
mass-ratio rockets.

4. What stable orbit clusters of mutually gravitating particles exist.

Oct 25
Finitization of problems
Perhaps many sets of axioms can be finitized by saying that every term with
more than a certain depth has value <bottom> and that all operations
on <bottom> yield <bottom>.  Decision procedures applied to such sets
of axioms correspond to proof procedures applied to the full set of
axioms but with limitations on depth of search.  However, using the
decision procedures may be more powerful and may give a more definite
answer.

Another finitization idea is to replace quantization over infinite
sets like the integers by algebraic relations involving maps into
and out of the integers.  This may amount to using category theory,
but we needn't be restricted to current category theory nor need we
follow all the wrinkles of current category theory.